Programming complexity - PDFSEARCH.IO - Document Search Engine

Programming complexity
Results: 456

#	Item
381	REHIST: Relative Error Histogram Construction Algorithms Add to Reading List Source URL: www.vldb.org Language: English - Date: 2006-07-29 01:28:01 Computational complexity theory Analysis of algorithms Non-parametric statistics Database theory V-optimal histograms Histogram Interval tree Dynamic programming Approximation algorithm Theoretical computer science Statistics Applied mathematics
382	Polymorphic Time Systems for Estimating Program Complexity Vincent Dornic 1 2 ; Pierre Jouvelot 1 3 Add to Reading List Source URL: www.psrg.lcs.mit.edu Language: English - Date: 2013-07-14 14:56:24 Type theory Data types Theoretical computer science Lambda calculus Formal methods Type system Programming language Fixed-point combinator Recursive data type Software engineering Computing Programming language theory
383	Measuring Software Flexibility Add to Reading List Source URL: www.eden-study.org Language: English - Date: 2007-03-23 20:31:50 Computer programming Abstraction Complex systems theory Complexity Systems Transdisciplinarity Information hiding Software design Design Patterns Software engineering Computing Holism
384	DAVID S. JOHNSON Address: 523 Computer Science Building Mail Code 0401 Department of Computer Science Add to Reading List Source URL: davidsjohnson.net Language: English - Date: 2014-01-22 11:11:57 Complexity classes Bin packing problem NP-complete ACM SIGACT Crossing number Linear programming Randomized algorithm Edward G. Coffman Jr. Computers and Intractability: A Guide to the Theory of NP-Completeness Theoretical computer science Applied mathematics Computational complexity theory
385	Approximating NP-hard Problems Efficient Algorithms and their Limits Prasad Raghavendra A dissertation submitted in partial fulfillment Add to Reading List Source URL: www.eecs.berkeley.edu Language: English - Date: 2009-10-30 11:58:51 Mathematical optimization Linear programming Computational complexity theory Combinatorial optimization Operations research Semidefinite programming Linear programming relaxation Relaxation Constraint satisfaction problem Theoretical computer science Mathematics Applied mathematics
386	Measuring Software Flexibility Add to Reading List Source URL: eden-study.org Language: English - Date: 2007-03-23 20:31:50 Computer programming Abstraction Complex systems theory Complexity Systems Transdisciplinarity Information hiding Software design Design Patterns Software engineering Computing Holism
387	Approximability of Constraint Satisfaction Problems Venkatesan Guruswami Carnegie Mellon University October 2009 Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2009-11-30 17:57:22 Constraint satisfaction problem Mathematics Computational complexity theory Mathematical optimization Probabilistic complexity theory Constraint satisfaction Combinatorial optimization Approximation algorithm Probabilistically checkable proof Theoretical computer science Constraint programming Applied mathematics
388	Final 0506 Quark 7 Annual Report:0506 draft 5.qxd.qxd Add to Reading List Source URL: www.newton.ac.uk Language: English - Date: 2007-01-12 05:07:34 Computational complexity theory Abstraction Logic in computer science Formal sciences Constraint programming Constraint satisfaction Finite model theory Mathematical logic Complexity Theoretical computer science Mathematics Applied mathematics
389	Every 2-CSP allows nontrivial approximation Johan H˚ astad Royal Institute of Technology Add to Reading List Source URL: www.nada.kth.se Language: English - Date: 2005-06-22 08:43:27 Constraint programming Computational complexity theory Constraint satisfaction problem 2-satisfiability Constraint satisfaction Approximation algorithm Logic in computer science Combinatorial optimization Linear programming Theoretical computer science Applied mathematics Mathematics
390	CSPs Classical results Semi-Definite programming Inapproximability results Classification Unique games Add to Reading List Source URL: www.nada.kth.se Language: English - Date: 2007-09-24 02:48:52 NP-complete problems Combinatorial optimization Operations research Cut Graph connectivity Maximum cut Approximation algorithm Semidefinite programming 2-satisfiability Theoretical computer science Computational complexity theory Mathematics